Jobs masonry in LHCb with elastic Grid Jobs
نویسندگان
چکیده
منابع مشابه
Monitoring Remote Jobs in a Grid System
When users submit jobs to a grid system, they desire to monitor the progress of the jobs for a number of reasons. In this paper, we present a small set of attributes about jobs that are of interest to users. Some grid systems already provide mechanisms for retrieving some of these attributes, whereas others do not. We use Legion as the implementation platform for demonstrating how these attribu...
متن کاملWeb Interface for Generic Grid Jobs, Web4Grid
For a long time grid has been used practically only by large projects which can afford to have fine-tuned sophisticated interfaces for the researchers involved on these projects. Grid has the potential to be a key instrument for a wide variety of scientific topics which require to perform many calculations, for example to explore complex system dynamics as function of parameters. The reduced si...
متن کاملScheduling jobs with chain precedence constraints and deteriorating jobs
In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polyn...
متن کاملGood jobs, bad jobs, and trade liberalization
☆ Much of this paper was written while Davis wa employed by, the Federal Reserve Bank of New York. The are those of the authors and do not necessarily refle Reserve Bank of New York or the Federal Reserve Syste Elhanan Helpman and Oleg Itskhoki for very helpful co this paper, and to seminar participants at Columbia, For and the NBER. ⁎ Corresponding author at: Department of Economi York, NY 100...
متن کاملScheduling with Incompatible Jobs
We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time. the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2015
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/664/6/062060